On the quality of local search for the quadratic assignment problem
نویسندگان
چکیده
منابع مشابه
On the Quality of Local Search for the Quadratic Assignment Problem
Local search is widely used to solve approximately NP-complete combinatorial optimization problems. But, few is known about quality of obtained local minima, for a given neighborhood. We concentrate on one of the most diicult optimization problems, the Quadratic Assignment Problem, and we give an upper bound for the quality of solutions obtained with deepest local search. Moreover, other recent...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملIterated local search for the quadratic assignment problem
Iterated local search (ILS) is a surprisingly simple but at the same time powerful metaheuristic for nding high quality approximate solutions for combinatorial optimization problems. ILS is based on the repeated application of a local search algorithm to initial solution which are obtained by mutations of previously found local optima | in most ILS algorithms these mutations are applied to the ...
متن کاملHierarchical Iterated Local Search for the Quadratic Assignment Problem
Iterated local search is a stochastic local search (SLS) method that combines a perturbation step with an embedded local search algorithm. In this article, we propose a new way of hybridizing iterated local search. It consists in using an iterated local search as the embedded local search algorithm inside another iterated local search. This nesting of local searches and iterated local searches ...
متن کاملBreakout local search for the quadratic assignment problem
The quadratic assignment problem (QAP) is one of the most studied combinatorial optimization problems with various practical applications. In this paper, we present Breakout Local Search (BLS) for solving QAP. BLS explores the search space by a joint use of local search and adaptive perturbation strategies. Experimental evaluations on the set of QAPLIB benchmark instances show that the proposed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00129-7